全文获取类型
收费全文 | 10025篇 |
免费 | 1657篇 |
国内免费 | 1325篇 |
专业分类
电工技术 | 680篇 |
综合类 | 1170篇 |
化学工业 | 221篇 |
金属工艺 | 137篇 |
机械仪表 | 512篇 |
建筑科学 | 288篇 |
矿业工程 | 193篇 |
能源动力 | 124篇 |
轻工业 | 285篇 |
水利工程 | 122篇 |
石油天然气 | 170篇 |
武器工业 | 150篇 |
无线电 | 1619篇 |
一般工业技术 | 436篇 |
冶金工业 | 60篇 |
原子能技术 | 81篇 |
自动化技术 | 6759篇 |
出版年
2024年 | 36篇 |
2023年 | 126篇 |
2022年 | 232篇 |
2021年 | 238篇 |
2020年 | 299篇 |
2019年 | 242篇 |
2018年 | 269篇 |
2017年 | 297篇 |
2016年 | 367篇 |
2015年 | 404篇 |
2014年 | 638篇 |
2013年 | 591篇 |
2012年 | 834篇 |
2011年 | 857篇 |
2010年 | 720篇 |
2009年 | 818篇 |
2008年 | 883篇 |
2007年 | 970篇 |
2006年 | 742篇 |
2005年 | 757篇 |
2004年 | 570篇 |
2003年 | 462篇 |
2002年 | 343篇 |
2001年 | 275篇 |
2000年 | 218篇 |
1999年 | 145篇 |
1998年 | 97篇 |
1997年 | 87篇 |
1996年 | 79篇 |
1995年 | 63篇 |
1994年 | 52篇 |
1993年 | 45篇 |
1992年 | 49篇 |
1991年 | 24篇 |
1990年 | 25篇 |
1989年 | 21篇 |
1988年 | 10篇 |
1987年 | 12篇 |
1986年 | 6篇 |
1985年 | 11篇 |
1984年 | 12篇 |
1983年 | 14篇 |
1982年 | 11篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
2.
提出一种视频点播系统传送数据的结构,结合单播与群播两种数据传送的方法,通过动态改变群播与单播的频道分配比例,让大部分的使用者无需等待即可开始观看影片,进而减少整体使用者的等待时间. 相似文献
3.
一种支持QoS的拓扑自适应动态组播路由算法 总被引:3,自引:0,他引:3
YAM、QoSMIC、DSDMR等一类支持QoS的动态组播路由算法允许组播成员动态地加入和离开,同时为接收方提供多个可选择的组播接入路径,以满足不同应用的QoS需求。但这些算法普遍存在控制信令开销大和结点加入时延长,可扩展性不好等问题。本文在分析这些算法的基础上,提出改进的支持QoS的动态组播路由算法,即拓扑自适应动态组播路由(Topology Adaptive Dynamic Multicast Routing,TADMR)算法。该算法避免了以往算法中大部分盲目的路径搜索,并使结点加入时延不再受限于固定的等待时钟,而与网络拓扑相自适应。性能分析和仿真结果表明,该算法具有较低的控制信令开销和结点加入时延,适用于各种网络规模和群组规模,具有良好的可扩展性。 相似文献
4.
5.
Education-driven research in CAD 总被引:1,自引:0,他引:1
We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals. 相似文献
6.
张鸿宾 《计算机应用与软件》1994,11(5):15-19,53
使用BP算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法,先构造决策树,然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长,它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果,本文的算法比用BP算法训练多层网络要快,而其分类精度不低于用BP算法训练的多层神经网。 相似文献
7.
ATM局域网仿真体系结构的研究 总被引:4,自引:0,他引:4
本文在简要叙述了基于ATM技术进行局域网仿真的原理后,对局域网仿真体系结构作了一些探讨。考虑的重点是无连接服务和群播功能的实现 相似文献
8.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献
9.
In recent years, the Asia-Pacific region has experienced several financial setbacks, including speculative attacks in 1998 and the SARS outbreak in 2003. Financial stresses of this nature are unanticipated, and not all of the dangers can be predicted by the examination of market information and macroeconomic indicators. The Early Warning System (EWS) that has been adopted by the International Monetary Fund may not be able to predict future financial crises for all possible scenarios, because shocks come in many different forms. To supplement the EWS, this paper proposes a data mining framework to measure the resilience of an economy. The resilience framework does not predict a crisis, but rather assesses the current state of health of an economy and its ability to withstand a financial shock should one occur. The framework is based on a feedback system consisting of two stages. The first stage assigns a resilience score to each economy based on a fuzzy logic scoring scheme that is built on the ambiguous reasoning of experts. The second stage uses the classification tree approach to estimate thresholds for each economic indicator, and examines the quality of the fuzzy score. The result from the second stage is then passed back to the first stage as feedback. The final result is obtained when the feedback system reaches its equilibrium state. The proposed resilience framework is applied to the external-sector and the public-sector economies of several countries to illustrate its applicability. 相似文献
10.